GEM-Tree: Tree-Based Analytic Geometrical Multi-Dimensional Content-Based Event Matching
نویسندگان
چکیده
منابع مشابه
Transfer Learning for Content-Based Recommender Systems Using Tree Matching
In this paper we present a new approach to content-based transfer learning for solving the data sparsity problem in cases when the users’ preferences in the target domain are either scarce or unavailable, but the necessary information on the preferences exists in another domain. We show that training a system to use such information across domains can produce better performance. Specifically, w...
متن کاملOvercoming the uncertainty in a research reactor LOCA in level-1 PSA; Fuzzy based fault-tree/event-tree analysis
Probabilistic safety assessment (PSA) which plays a crucial role in risk evaluation is a quantitative approach intended to demonstrate how a nuclear reactor meets the safety margins as part of the licensing process. Despite PSA merits, some shortcomings associated with the final results exist. Conventional PSA uses crisp values to represent the failure probabilities of basic events. This causes...
متن کاملTree based object matching using multi-scale covariance descriptor
Object matching is the process of determining the presence and the location of a reference object inside a scene image. Matching accuracy requires robust image description and efficient similarity measures. In this paper, we present a tree based object matching approach using a descriptor proposed in a previous work [1]. Visual objects are described by a collection of multi-scale covariance mat...
متن کاملParsing Tree Matching Based Question Answering
This paper describes the Question and Answering system participating Question Answering track in Text Analysis Conference organized by National Institute of Standard and Technology 2008. Our Question and Answering system attempts to use a human style of logic to search their respective document sources and return possible answers to a question.
متن کاملCorpus-based syntax-prosody tree matching
Empirical study of the syntax-prosody relation is hampered by the fact that current prosodic models are essentially linear, while syntactic structure is hierarchical. The present contribution describes a syntax-prosody comparison heuristic based on two new algorithms: Time Tree Induction, TTI, for building a prosodic treebank from time-annotated speech data, and Tree Similarity Indexing, TSI) f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2953094